- network flow optimization
- Вычислительная техника: оптимизация сетевых потоков
Универсальный англо-русский словарь. Академик.ру. 2011.
network flow optimization
Смотреть что такое "network flow optimization" в других словарях:
Network theory — For network theory of the regulation of the adaptive immune system see Immune network theory For the sociological theory, see Social network Network theory is an area of computer science and network science and part of graph theory. It has… … Wikipedia
Network-Centric Service-Oriented Enterprise (NCSOE) — is a new generation enterprise capable of conducting collaboration and management of internal and external information. Using Network Centric Enterprise Services (NCES) , the enterprise can now enforce information and decision superiority in a… … Wikipedia
optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of … Universalium
Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… … Wikipedia
Optimization (computer science) — In computing, optimization is the process of modifying a system to make some aspect of it work more efficiently or use fewer resources. For instance, a computer program may be optimized so that it executes more rapidly, or is capable of operating … Wikipedia
Network neutrality — This article is about the general principle of network neutrality. For its specific application to Canada, see Network neutrality in Canada. For its application to the U.S., see Network neutrality in the United States. Network Neutrality Related… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Multi-objective optimization — (or multi objective programming),[1][2] also known as multi criteria or multi attribute optimization, is the process of simultaneously optimizing two or more conflicting objectives subject to certain constraints. Multiobjective optimization… … Wikipedia
Multi-commodity flow problem — The multi commodity flow problem is a network flow problem with multiple commodities (or goods) flowing through the network, with different source and sink nodes. Contents 1 Definition 2 Relation to other problems 3 Usage 4 … Wikipedia
Nowhere-zero flow — In graph theory, nowhere zero flows are a special type of network flow which is related (by duality) to coloring planar graphs. Let G = (V,E) be a directed graph and let M be an abelian group. We say that a map is a flow or an M flow if the… … Wikipedia
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
